Guarded Second-Order Logic, Spanning Trees, and Network Flows
نویسندگان
چکیده
منابع مشابه
Guarded Second-Order Logic, Spanning Trees, and Network Flows
According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable k-sparse hypergraphs. In the first part of the present paper we extend this result to hypergraphs of arbitrary cardinality. In the second part, we present a generalisation dealing with method...
متن کاملMonadic Second-Order Logic and Transitive Closure Logics over Trees
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical formalisms. The central tool for model theoretic syntax has been monadic second-order logic (MSO). Much of the recent research in this area has been concerned with finding more expressive logics to capture the derivation ...
متن کاملExpressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier “there exist uncountably many sets”. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over ...
متن کاملSecond-Order Equational Logic
We provide an extension of universal algebra and its equational logic from first to second order. Conservative extension, soundness, and completeness results are established.
متن کاملFirst-Order Logic, Second-Order Logic, and Completeness
Both firstand second-order logic (FOL and SOL, respectively) as we use them today were arguably created by Frege in his Begriffsschrift – if we ignore the notational differences. SOL also suggests itself as a natural, and because of its much greater strength, desirable extension of FOL. But at least since W. V. Quine’s famous claim that SOL is “set theory in sheep’s clothing” it is widely held ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2010
ISSN: 1860-5974
DOI: 10.2168/lmcs-6(1:4)2010